The Niceness of Unique Sink Orientations
نویسندگان
چکیده
Random Edge is the most natural randomized pivot rule for the simplex algorithm. Considerable progress has been made recently towards fully understanding its behavior. Back in 2001, Welzl introduced the concepts of reachmaps and niceness of Unique Sink Orientations (USO), in an effort to better understand the behavior of Random Edge. In this paper, we initiate the systematic study of these concepts. We settle the questions that were asked by Welzl about the niceness of (acyclic) USO. Niceness implies natural upper bounds for Random Edge and we provide evidence that these are tight or almost tight in many interesting cases. Moreover, we show that Random Edge is polynomial on at least n ) many (possibly cyclic) USO. As a bonus, we describe a derandomization of Random Edge which achieves the same asymptotic upper bounds with respect to niceness.
منابع مشابه
Unique Sink Orientations of Cubes
Subject of this thesis is the theory of unique sink orientations of cubes. Such orientations are suitable to model problems from different areas of combinatorial optimization. In particular, unique sink orientations are closely related to the running time of the simplex algorithm. In the following, we try to answer three main questions: How can optimization problems be translated into the frame...
متن کاملUnique Sink Orientations of Cubes
Suppose we are given (the edge graph of) an dimensional hypercube with its edges oriented so that every face has a unique sink. Such an orientation is called a unique sink orientation, and we are interested in finding the unique sink of the whole cube, when the orientation is given implicitly. The basic operation available is the socalled vertex evaluation, where we can access an arbitrary vert...
متن کاملCounting Unique-Sink Orientations
Unique-sink orientations (USOs) are an abstract class of orientations of the ncube graph. We consider some classes of USOs that are of interest in connection with the linear complementarity problem. We summarise old and show new lower and upper bounds on the sizes of some such classes. Furthermore, we provide a characterisation of K-matrices in terms of their corresponding USOs.
متن کاملSinks in Acyclic Orientations of Graphs
Greene and Zaslavsky proved that the number of acyclic orientations of a graph G with a unique sink at a given vertex is, up to sign, the linear coefficient of the chromatic polynomial. We give three proofs of this result using pure induction, noncommutative symmetric functions, and an algorithmic bijection. We also prove their result that if e=u0v0 is an edge of G then the number of acyclic or...
متن کاملPseudo Unique Sink Orientations
A unique sink orientation (USO) is an orientation of the n-dimensional cube graph (n-cube) such that every face (subcube) has a unique sink. The number of unique sink orientations is nΘ(2 n) [13]. If a cube orientation is not a USO, it contains a pseudo unique sink orientation (PUSO): an orientation of some subcube such that every proper face of it has a unique sink, but the subcube itself hasn...
متن کامل